| 1. | The convergence of an algorithm for the reverse convex programming
一类反凸规划算法的收敛性 |
| 2. | The affine scaling algorithm for convex programming with linear constraints
线性约束凸规划问题的仿尺度算法 |
| 3. | Convex programming problem
凸规划问题 |
| 4. | Solving linearly constrained convex programming by potential reduction interior - point algorithm
求解线性约束凸规划的势下降内点算法 |
| 5. | Finally , the relationships between generalized set - valued variational inclusion problems and non - convex programming are studied
最后研究了广义集值变分包含问题与非凸规划之间的关系。 |
| 6. | Fifthly , the parameter control methods for solving convex programming , especially linear programming and convex quadratic programming , are discussed and its convergence iv is probed
五是研究了凸规划包括线性规划和凸二次规划的参数控制算法及其收敛性。 |
| 7. | Abstract : this paper presents a new primal ? dual interior point algorithm for a convex programming with box constraints , and prove the iteration complexity is polynomial
文摘:本文为框式约束的一类凸规划提出了一个新的内点算法，原始-对偶路径跟踪法，并证明了算法的迭代复杂性为多项式时间性 |
| 8. | The mathematical programming methods , both the method of moving asymptotes ( mma ) belonging to convex programming methods and the sequential linear programming method ( slp ) , were used to solving optimization problems
用移动渐进线方法( mma )求解单目标优化问题，用序列线性规划方法( slp )求解模糊目标混合规划问题。 |
| 9. | Finally , prove that any global optimal solution of the converted concave minimization problem or reverse convex programming problem obtained by the existing algorithms is an approximate global optimal solution of the original problem
最后，还证明了得到的凹规划和反凸规划的全局最优解就是原问题的近似全局最优解。 |
| 10. | Abstract : an algorithm of indefinite quadratic programming over unbound domain is presented ; the indefi nite quadratic programming is translated into a series of convex programming and the convergence of algorithm is discussed
文摘:给出了无界域上不定二次规划的一个算法，该算法将不定二次规划转化为一系列凸二次规划，并证明了算法的收敛性 |
